``Not both $p$ and $q$, therefore if $p$ then $q$'' is a valid form of argument.
نویسندگان
چکیده
منابع مشابه
On the Evaluation of If p then q Conditionals
We propose that when evaluating conditionals, people construct an imaginary world that contains the antecedent, and then evaluate the plausibility of the consequent being true in the same world. Thus, when asked for an estimate of the probability of the conditional, people should produce the conditional probability of its consequent given its antecedent. We contrast this view with a view based ...
متن کاملON INTEGERS NOT OF THE FORM ±p ± q
In 1975 F. Cohen and J.L. Selfridge found a 94-digit positive integer which cannot be written as the sum or difference of two prime powers. Following their basic construction and introducing a new method to avoid a bunch of extra congruences, we are able to prove that if x ≡ 47867742232066880047611079 (mod 66483034025018711639862527490), then x is not of the form±pa±qb where p, q are primes and...
متن کاملThe First and Second Zagreb Indices, First and Second Zagreb Polynomials of HAC5C6C7[p,q] and HAC5C7[p,q] Nanotubes
Topological indices are numerical parameters of a molecular graph G which characterize its topology. On the other hands, computing the connectivity indices of molecular graphs is an important branch in chemical graph theory. Therefore, we compute First Zagreb index Zg <span style="font-family: TimesNewRomanPS-Italic...
متن کاملOF U ( p , q ) AND Spin 0 ( p , q )
Let p > q and let G be the group U(p, q) or Spin0(p, q). Let P = LN be the maximal parabolic subgroup of G with Levi subgroup L ∼=M × U where (M,U) = { (GLq(C),U(p− q)) if G = U(p, q) (GLq (R),Spin(p− q)) if G = Spin0(p, q). Let χ be a 1 dimensional character of M and τ an irreducible representation of U with highest weight μ. Let πχ,μ be the representation of P which is trivial on N and πχ,μ|L...
متن کاملCount(q) Does Not Imply Count(p)
I solve a conjecture originally studied by M. Ajtai. It states that for different primes q, p the matching principles Count(q) and Count(p) are logically independent. I prove that this indeed is the case. Actually I show that Count(q) implies Count(p) exactly when each prime factor in p also is a factor in q. 1 The logic of elementary counting “She loves me, she loves me not, she loves me,. . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1977
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093888129